Region Counting Circles
نویسندگان
چکیده
The region counting distances, introduced by Demaine, Iacono and Langerman [5], associate to any pair of points p, q the number of items of a dataset S contained in a region R(p, q) surrounding p, q. We define region counting disks and circles, and study the complexity of these objects. In particular, we prove that for some wide class of regions R(p, q), the complexity of a region counting circle of radius k is either at least as large as the complexity of the k-level in an arrangement of lines, or is linear in |S|. We give a complete characterization of regions falling into one of these two cases. Algorithms to compute -approximations of region counting distances and approximations of region counting circles are presented.
منابع مشابه
Region Counting Distances and Region Counting Circles
The region counting distances, introduced by Demaine, Iacono and Langerman [5], associate to any pair of points p, q the number of items of a dataset S contained in a region R(p, q) surrounding p, q. We define region counting disks and circles, and study the complexity of these objects. In particular, we prove that for some wide class of regions R(p, q), the complexity of a region counting circ...
متن کاملCapture Largest Included Circles: An Approach for Counting Red Blood Cells
Complete Blood Count (CBC) is a standard medical test that can help diagnose various conditions and diseases. Manual counting of blood cells is highly tedious and time consuming. However, new methods for counting blood cells are customary employing both electronic and computer-assisted techniques. Image segmentation is a classical task in most image processing applications which can be used to ...
متن کاملLamoenian Circles of the Collinear Arbelos
For a point T and a circle δ, if two congruent circles of radius r touching at T also touch δ at points different from T , we say T generates circles of radius r with δ, and the two circles are said to be generated by T with δ. If the generated circles are Archimedean, we say T generates Archimedean circles with δ. Frank Power seems to be the earliest discoverer of this kind Archimedean circles...
متن کاملCounting Circles Without Computing Them
In this paper we engineer a fast algorithm to count the number of triangles defined by three lines out of a set of n lines whose circumcircle contains the origin. The trick is not to compute any triangles or circles. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
متن کامل"Look, some Green Circles!": Learning to Quantify from Images
In this paper, we investigate whether a neural network model can learn the meaning of natural language quantifiers (no, some and all) from their use in visual contexts. We show that memory networks perform well in this task, and that explicit counting is not necessary to the system’s performance, supporting psycholinguistic evidence on the acquisition of quantifiers.
متن کامل